Total Domination and Matching Numbers in Claw-Free Graphs
نویسندگان
چکیده
منابع مشابه
Total Domination and Matching Numbers in Claw-Free Graphs
A set M of edges of a graph G is a matching if no two edges in M are incident to the same vertex. The matching number of G is the maximum cardinality of a matching of G. A set S of vertices in G is a total dominating set of G if every vertex of G is adjacent to some vertex in S. The minimum cardinality of a total dominating set of G is the total domination number of G. If G does not contain K1,...
متن کاملClaw-Free Graphs with Equal 2-Domination and Domination Numbers
For a graph G a subsetD of the vertex set of G is a k-dominating set if every vertex not in D has at least k neighbors in D. The k-domination number γk(G) is the minimum cardinality among the k-dominating sets of G. Note that the 1-domination number γ1(G) is the usual domination number γ(G). Fink and Jacobson showed in 1985 that the inequality γk(G) ≥ γ(G) + k − 2 is valid for every connected g...
متن کاملTotal $k$-Rainbow domination numbers in graphs
Let $kgeq 1$ be an integer, and let $G$ be a graph. A {it$k$-rainbow dominating function} (or a {it $k$-RDF}) of $G$ is afunction $f$ from the vertex set $V(G)$ to the family of all subsetsof ${1,2,ldots ,k}$ such that for every $vin V(G)$ with$f(v)=emptyset $, the condition $bigcup_{uinN_{G}(v)}f(u)={1,2,ldots,k}$ is fulfilled, where $N_{G}(v)$ isthe open neighborhood of $v$. The {it weight} o...
متن کاملBounds on total domination in claw-free cubic graphs
A set S of vertices in a graphG is a total dominating set, denoted by TDS, ofG if every vertex ofG is adjacent to some vertex in S (other than itself). The minimum cardinality of a TDS ofG is the total domination number ofG, denoted by t(G). IfG does not contain K1,3 as an induced subgraph, then G is said to be claw-free. It is shown in [D. Archdeacon, J. Ellis-Monaghan, D. Fischer, D. Froncek,...
متن کاملUpper paired-domination in claw-free graphs
A set S of vertices in a graph G is a paired-dominating set of G if every vertex of G is adjacent to some vertex in S and if the subgraph induced by S contains a perfect matching. The maximum cardinality of a minimal paired-dominating set of G is the upper paired-domination number of G, denoted by pr(G). We establish bounds on pr(G) for connected claw-free graphs G in terms of the number n of v...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2006
ISSN: 1077-8926
DOI: 10.37236/1085